منابع مشابه
No Easy Puzzles: A Hardness Result for Jigsaw Puzzles
We show that solving jigsaw puzzles requires Θ(n ) edge matching comparisons, making them as hard as their trivial upper bound. This result generalises to puzzles of all shapes, and is applicable to both pictorial and apictorial puzzles.
متن کاملShotgun Assembly of Random Jigsaw Puzzles
In a recent work, Mossel and Ross considered the shotgun assembly problem for a random jigsaw puzzle. Their model consists of a puzzle an n×n grid, where each vertex is viewed as a center of a piece. They assume that each of the four edges adjacent to a vertex, is assigned one of q colors (corresponding to ”jigs”, or cut shapes) uniformly at random. Mossel and Ross asked: how large should q = q...
متن کاملUnique reconstruction threshold for random jigsaw puzzles
A random jigsaw puzzle is constructed by arranging n2 square pieces into an n× n grid and assigning to each edge of a piece one of q available colours uniformly at random, with the restriction that touching edges receive the same colour. We show that if q = o(n) then with high probability such a puzzle does not have a unique solution, while if q ≥ n1+ε for any constant ε > 0 then the solution i...
متن کاملBuilding programmable jigsaw puzzles with RNA.
One challenge in supramolecular chemistry is the design of versatile, self-assembling building blocks to attain total control of arrangement of matter at a molecular level. We have achieved reliable prediction and design of the three-dimensional structure of artificial RNA building blocks to generate molecular jigsaw puzzle units called tectosquares. They can be programmed with control over the...
متن کاملShotgun edge assembly of random jigsaw puzzles
In recent work by Mossel and Ross, it was asked how large q has to be for a random jigsaw puzzle with q different shapes of “jigs” to have exactly one solution. The jigs are assumed symmetric in the sense that two jigs of the same type always fit together. They showed that for q = o(n) there are a.a.s. multiple solutions, and for q = ω(n) there is a.a.s. exactly one. The latter bound has since ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature Immunology
سال: 2012
ISSN: 1529-2908,1529-2916
DOI: 10.1038/ni.2327